Building Real-World Complex Networks by Wandering on Random GraphsGAUME, Bruno; MATHIEU, Fabien; NAVARRO, Emmanuel et al.Information interaction intelligence. 2010, Vol 10, Num 1, pp 73-91, issn 1630-649X, 19 p.Article

Complementary cycles in regular multipartite tournaments, where one cycle has length fiveZHIHONG HE; KORNEFFEL, Torsten; MEIERLING, Dirk et al.Discrete mathematics. 2009, Vol 309, Num 10, pp 3131-3149, issn 0012-365X, 19 p.Article

Graphes et algorithmes pour ballons = Graphs and algorithms for balloonsDELAHAYE, Jean-Paul.Pour la science (Imprimé). 2009, Num 380, pp 88-93, issn 0153-4092, 6 p.Article

Every cycle-connected multipartite tournament has a universal arcVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2009, Vol 309, Num 4, pp 1013-1017, issn 0012-365X, 5 p.Article

Nash equilibria in all-optical networksGEORGAKOPOULOS, George F; KAVVADIAS, Dimitris J; SIOUTIS, Leonidas G et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4332-4342, issn 0012-365X, 11 p.Article

Non-separating trees in connected graphsDIWAN, Ajit A; THOLIYA, Namrata P.Discrete mathematics. 2009, Vol 309, Num 16, pp 5235-5237, issn 0012-365X, 3 p.Article

On spanning tree congestionLÖWENSTEIN, Christian; RAUTENBACH, Dieter; REGEN, Friedrich et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4653-4655, issn 0012-365X, 3 p.Article

Trees through specified verticesCUTLER, J.Discrete mathematics. 2009, Vol 309, Num 9, pp 2749-2754, issn 0012-365X, 6 p.Article

Two kinds of hook length formulas for complete m-ary treesYIDONG SUN; HUAJUN ZHANG.Discrete mathematics. 2009, Vol 309, Num 8, pp 2584-2591, issn 0012-365X, 8 p.Article

Vertex-magic labelings of regular graphs IIGRAY, I. D; MACDOUGALL, J. A.Discrete mathematics. 2009, Vol 309, Num 20, pp 5986-5999, issn 0012-365X, 14 p.Article

A short proof of Fleischner's theoremGEORGAKOPOULOS, Agelos.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6632-6634, issn 0012-365X, 3 p.Article

Hamilton-connected indices of graphsCHEN, Zhi-Hong; LAI, Hong-Jian; LIMING XIONG et al.Discrete mathematics. 2009, Vol 309, Num 14, pp 4819-4827, issn 0012-365X, 9 p.Article

Independent sets and non-augmentable paths in generalizations of tournamentsGALEANA-SANCHEZ, Hortensia; GOMEZ, Ricardo.Discrete mathematics. 2008, Vol 308, Num 12, pp 2460-2472, issn 0012-365X, 13 p.Article

Multivariate Fuss-Catalan numbersAVAL, Jean-Christophe.Discrete mathematics. 2008, Vol 308, Num 20, pp 4660-4669, issn 0012-365X, 10 p.Article

On 2-factors with k componentsSARKÖZY, Gabor N.Discrete mathematics. 2008, Vol 308, Num 10, pp 1962-1972, issn 0012-365X, 11 p.Article

On a cyclic connectivity property of directed graphsHUBENKO, Alice.Discrete mathematics. 2008, Vol 308, Num 7, pp 1018-1024, issn 0012-365X, 7 p.Article

On arbitrarily vertex decomposable treesHORNAK, Mirko; WOZNIAK, Mariusz.Discrete mathematics. 2008, Vol 308, Num 7, pp 1268-1281, issn 0012-365X, 14 p.Article

On spanning connected graphsLIN, Cheng-Kuan; HUANG, Hua-Min; TAN, Jimmy J. M et al.Discrete mathematics. 2008, Vol 308, Num 7, pp 1330-1333, issn 0012-365X, 4 p.Article

Radio number for treesLIU, Daphne Der-Fen.Discrete mathematics. 2008, Vol 308, Num 7, pp 1153-1164, issn 0012-365X, 12 p.Article

Semi-total graph colourings, the beta parameter, and total chromatic numberWILLIAMS, Jini; HOLROYD, Fred.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 940-954, issn 0012-365X, 15 p.Conference Paper

A local characterization of bounded clique-width for line graphsGURSKI, Frank; WANKE, Egon.Discrete mathematics. 2007, Vol 307, Num 6, pp 756-759, issn 0012-365X, 4 p.Article

Chromatic sums of general maps on the sphere and the projective planeZHAOXIANG LI; YANPEI LIU.Discrete mathematics. 2007, Vol 307, Num 1, pp 78-87, issn 0012-365X, 10 p.Article

On a conjecture about the Randié indexAOUCHICHE, Mustapha; HANSEN, Pierre.Discrete mathematics. 2007, Vol 307, Num 2, pp 262-265, issn 0012-365X, 4 p.Article

On conjugate adjacency matrices of a graphLEPOVIC, Mirko.Discrete mathematics. 2007, Vol 307, Num 6, pp 730-738, issn 0012-365X, 9 p.Article

On partitioning of hypergraphsBEZRUKOV, Sergei L; BATTITI, Roberto.Discrete mathematics. 2007, Vol 307, Num 14, pp 1737-1753, issn 0012-365X, 17 p.Article